/*
 * Copyright (c) 2021.版权所有高金磊
 */

package 领扣算法.AA中等题.查找和最小的K对数字;

import java.util.LinkedList;
import java.util.List;

public class Main {

    public static void main(String arg[]) {//main--来自高金磊

        new Main().kSmallestPairs(new int[]{1, 2, 9}, new int[]{2, 5, 8, 9}, 100);
    }

    public List<List<Integer>> kSmallestPairs(int[] nums1, int[] nums2, int k) {
        int index[] = new int[nums1.length];
        LinkedList<LinkedList<Integer>> data = new LinkedList<>();
        for (int i = 0; i < Math.max(nums1.length, nums2.length); i++) {
            for (int j = 0; j <= Math.min(i, nums1.length - 1); j++) {
                LinkedList<Integer> middle = new LinkedList<>();
                middle.addLast(nums1[j]);
                middle.addLast(nums2[index[j]]);
                data.addLast(middle);
                index[j]++;
            }
        }
        return null;
    }
}
